A hybrid of genetic algorithm and Fletcher-Reeves for bound constrained optimization problems
نویسندگان
چکیده
منابع مشابه
A Hybrid Genetic Algorithm for Constrained Optimization Problems
Genetic algorithm (GA) is a powerful method to solve constrained optimization problems (COPs). In this paper, a new fitness function based hybrid genetic optimization algorithm (NFFHGA) for COPs is proposed, in which a new crossover operator based on Union Design is presented, and inspired by the smooth function technique, a new fitness function is designed to automatically search for potential...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملa new hybrid flower pollination algorithm for solving constrained global optimization problems
global optimization methods play an important role to solve many real-world problems. flower pollination algorithm (fp) is a new nature-inspired algorithm, based on the characteristics of flowering plants. in this paper, a new hybrid optimization method called hybrid flower pollination algorithm (fppso) is proposed. the method combines the standard flower pollination algorithm (fp) with the par...
متن کاملA Hybrid of Differential Evolution and Genetic Algorithm for Constrained Multiobjective Optimization Problems
Two novel schemes of selecting the current best solutions for multiobjective differential evolution are proposed in this paper. Based on the search biases strategy suggested by Runarsson and Yao, a hybrid of multiobjective differential evolution and genetic algorithm with (N+N) framework for constrained MOPs is given. And then the hybrid algorithm adopting the two schemes respectively is compar...
متن کاملA Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems
In this paper, we present a powerful hybrid genetic algorithm based around a heuristic timetabling framework. This combines a direct representation of the timetable with heuristic crossover operators to ensure that the most fundamental constraints are never violated. We explain how the population is seeded so as to produce a solution which cannot be outperformed by the heuristic method alone. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Decision Science Letters
سال: 2015
ISSN: 1929-5804,1929-5812
DOI: 10.5267/j.dsl.2015.1.003